Right-to-Left Code Generation for Arithmetic Expressions
نویسندگان
چکیده
منابع مشابه
Fixed-point arithmetic for ASIP code generation
In this paper we present an environment supporting fixed-point arithmetic in C programs. It allows the specification of the position of the binary point in the source code and code generation for architectures with hardware support for the fixed-point arithmetic. Our tools are implemented on the top of the SUIF C compiler[1] and do not require any special adaptations. We demonstrate the validit...
متن کاملLeft-to-Right Target Generation for Hierarchical Phrase-Based Translation
We present a hierarchical phrase-based statistical machine translation in which a target sentence is efficiently generated in left-to-right order. The model is a class of synchronous-CFG with a Greibach Normal Form-like structure for the projected production rule: The paired target-side of a production rule takes a phrase prefixed form. The decoder for the targetnormalized form is based on an E...
متن کاملAutomatic Generation of C++/java Code for Binary Arithmetic Coding
Binary arithmetic coding is, compression-wise, the most effective statistical coding method used in image and video compression. It is being used for compressing bi-level images/videos (JBIG, JBIG2, MPEG-4 shape coding) and is also optionally being utilized for coding of continuous-tone images/videos (JPEG, H.264). Despite its wide use, different arithmetic coders are generally incompatible wit...
متن کاملA Simple Left-to-Right Algorithm for the Computation of the Arithmetic Weight of Integers
We present a simple algorithm for computing the arithmetic weight of an integer with respect to a given radix r ≥ 2. The arithmetic weight of n is the minimum number of nonzero digits in any signed radix-r representation of n. This algorithm leads to a new family of minimal weight signed radix-r representations which can be constructed using a left-to-right on-line algorithm. These representati...
متن کاملLearning Left-to-Right and Right-to-Left Iterative Languages
The left-to-right and right-to-left iterative languages are previously unnoticed subclasses of the regular languages of infinite size that are identifiable in the limit from positive data. Essentially, these language classes are the ones obtained by merging final states in a prefix tree and initial states in a suffix tree of the observed sample, respectively. Strikingly, these classes are also ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1982
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/25.3.316